Some Simple Applications of the Travelling Salesman Problem

Some applications of the clustered travelling salesman problem

The purpose of this article is to describe several applications of the clustered travelling salesman problem (CTSP), a variant of the well-known travelling salesman problem (TSP). The CTSP is defined on a complete graph G 1⁄4 ðV ;EÞ in the undirected case or (V, A) in the directed case, where V 1⁄4 fv1; . . . ; vng is a vertex set partitioned into m clusters V1; . . . ;Vm. The set E 1⁄4 fðvi; v...

Applications and Formulations of the Travelling Salesman Problem

Applications Of Ant Colony Optimization ACO ( Travelling Salesman Problem

-The ant colony optimization takes insipiration from the foraging behavior of some ant species.These ants deposits pheromone on the ground in order to make some suitable path that should be followed by other members of the colony.The goal of this paper is to introduce ant colony optimization and to survey its most notable applications.In this paper we focus on some research efforts directed at ...

The multi-stripe travelling salesman problem

In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with [Formula: see text], the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic a...

Ant colonies for the travelling salesman problem.

We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer simulations demonstrate that the artificial ant colony is capable of generating good solutions to b...